0.08/0.11	% Problem    : Vampire---4.8_5356 : TPTP v0.0.0. Released v0.0.0.
0.08/0.11	% Command    : run_E %s %d THM
0.11/0.31	% Computer : n008.cluster.edu
0.11/0.31	% Model    : x86_64 x86_64
0.11/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.31	% Memory   : 8042.1875MB
0.11/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.31	% CPULimit   : 1440
0.11/0.31	% WCLimit    : 180
0.11/0.31	% DateTime   : Mon Jul  3 13:03:49 EDT 2023
0.16/0.31	% CPUTime    : 
0.16/0.49	Running higher-order theorem provingRunning: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.MpcRNBRXAQ/Vampire---4.8_5356
0.16/0.49	# Version: 3.1pre001-ho
0.16/0.54	# Preprocessing class: HSLMSMSSLLLCHSA.
0.16/0.54	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.16/0.54	# Starting lpo1_fix with 540s (3) cores
0.16/0.54	# Starting full_lambda_9 with 180s (1) cores
0.16/0.54	# Starting almost_fo_4 with 180s (1) cores
0.16/0.54	# Starting new_ho_9 with 180s (1) cores
0.16/0.54	# Starting pre_casc_4 with 180s (1) cores
0.16/0.54	# Starting ho_unfolding_6 with 180s (1) cores
0.16/0.54	# pre_casc_4 with pid 5711 completed with status 0
0.16/0.54	# Result found by pre_casc_4
0.16/0.54	# Preprocessing class: HSLMSMSSLLLCHSA.
0.16/0.54	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.16/0.54	# Starting lpo1_fix with 540s (3) cores
0.16/0.54	# Starting full_lambda_9 with 180s (1) cores
0.16/0.54	# Starting almost_fo_4 with 180s (1) cores
0.16/0.54	# Starting new_ho_9 with 180s (1) cores
0.16/0.54	# Starting pre_casc_4 with 180s (1) cores
0.16/0.54	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.16/0.54	# Search class: HGUSM-FFMM31-DHSMMSBN
0.16/0.54	# partial match(3): HGHSM-FFMM31-SHSSMSBN
0.16/0.54	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.16/0.54	# Starting new_ho_10 with 98s (1) cores
0.16/0.54	# new_ho_10 with pid 5714 completed with status 0
0.16/0.54	# Result found by new_ho_10
0.16/0.54	# Preprocessing class: HSLMSMSSLLLCHSA.
0.16/0.54	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.16/0.54	# Starting lpo1_fix with 540s (3) cores
0.16/0.54	# Starting full_lambda_9 with 180s (1) cores
0.16/0.54	# Starting almost_fo_4 with 180s (1) cores
0.16/0.54	# Starting new_ho_9 with 180s (1) cores
0.16/0.54	# Starting pre_casc_4 with 180s (1) cores
0.16/0.54	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.16/0.54	# Search class: HGUSM-FFMM31-DHSMMSBN
0.16/0.54	# partial match(3): HGHSM-FFMM31-SHSSMSBN
0.16/0.54	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.16/0.54	# Starting new_ho_10 with 98s (1) cores
0.16/0.54	# Preprocessing time       : 0.005 s
0.16/0.54	# Presaturation interreduction done
0.16/0.54	
0.16/0.54	# Proof found!
0.16/0.54	# SZS status Theorem
0.16/0.54	# SZS output start CNFRefutation
0.16/0.54	thf(decl_22, type, is_of: $i > ($i > $o) > $o).
0.16/0.54	thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o).
0.16/0.54	thf(decl_25, type, in: $i > $i > $o).
0.16/0.54	thf(decl_77, type, e_is: $i > $i > $i > $o).
0.16/0.54	thf(decl_123, type, nat: $i).
0.16/0.54	thf(decl_124, type, n_is: $i > $i > $o).
0.16/0.54	thf(decl_142, type, n_pl: $i > $i > $i).
0.16/0.54	thf(decl_153, type, esk1_0: $i).
0.16/0.54	thf(decl_154, type, esk2_0: $i).
0.16/0.54	thf(decl_155, type, esk3_0: $i).
0.16/0.54	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.MpcRNBRXAQ/Vampire---4.8_5356', def_all_of)).
0.16/0.54	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.MpcRNBRXAQ/Vampire---4.8_5356', def_is_of)).
0.16/0.54	thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox2/tmp/tmp.MpcRNBRXAQ/Vampire---4.8_5356', def_e_is)).
0.16/0.54	thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox2/tmp/tmp.MpcRNBRXAQ/Vampire---4.8_5356', def_n_is)).
0.16/0.54	thf(satz20e, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X197:$i]:((in @ X197 @ nat))) @ (^[X198:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:(((n_is @ X1 @ X198)<=(n_is @ (n_pl @ X4 @ X1) @ (n_pl @ X4 @ X198)))))))))))), file('/export/starexec/sandbox2/tmp/tmp.MpcRNBRXAQ/Vampire---4.8_5356', satz20e)).
0.16/0.54	thf(satz6, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X229:$i]:((in @ X229 @ nat))) @ (^[X230:$i]:((n_is @ (n_pl @ X1 @ X230) @ (n_pl @ X230 @ X1)))))))), file('/export/starexec/sandbox2/tmp/tmp.MpcRNBRXAQ/Vampire---4.8_5356', satz6)).
0.16/0.54	thf(satz8a, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X221:$i]:((in @ X221 @ nat))) @ (^[X222:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:(((n_is @ (n_pl @ X1 @ X222) @ (n_pl @ X1 @ X4))=>(n_is @ X222 @ X4))))))))))), file('/export/starexec/sandbox2/tmp/tmp.MpcRNBRXAQ/Vampire---4.8_5356', satz8a)).
0.16/0.54	thf(c_0_7, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
0.16/0.54	thf(c_0_8, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
0.16/0.54	thf(c_0_9, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])).
0.16/0.54	thf(c_0_10, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_7, c_0_8])).
0.16/0.54	thf(c_0_11, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_9])).
0.16/0.54	thf(c_0_12, negated_conjecture, ~(![X392:$i]:(((in @ X392 @ nat)=>![X391:$i]:(((in @ X391 @ nat)=>![X390:$i]:(((in @ X390 @ nat)=>(((n_pl @ X390 @ X392)=(n_pl @ X390 @ X391))=>((X392)=(X391)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz20e])]), c_0_10]), c_0_11])])).
0.16/0.54	thf(c_0_13, plain, ![X400:$i]:(((in @ X400 @ nat)=>![X399:$i]:(((in @ X399 @ nat)=>((n_pl @ X400 @ X399)=(n_pl @ X399 @ X400)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz6]), c_0_10]), c_0_11])).
0.16/0.54	thf(c_0_14, negated_conjecture, ((in @ esk1_0 @ nat)&((in @ esk2_0 @ nat)&((in @ esk3_0 @ nat)&(((n_pl @ esk3_0 @ esk1_0)=(n_pl @ esk3_0 @ esk2_0))&((esk1_0)!=(esk2_0)))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])).
0.16/0.54	thf(c_0_15, plain, ![X479:$i, X480:$i]:((~(in @ X479 @ nat)|(~(in @ X480 @ nat)|((n_pl @ X479 @ X480)=(n_pl @ X480 @ X479))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])).
0.16/0.54	thf(c_0_16, negated_conjecture, ((n_pl @ esk3_0 @ esk1_0)=(n_pl @ esk3_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.16/0.54	thf(c_0_17, plain, ![X1:$i, X4:$i]:((((n_pl @ X1 @ X4)=(n_pl @ X4 @ X1))|~((in @ X1 @ nat))|~((in @ X4 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_15])).
0.16/0.54	thf(c_0_18, negated_conjecture, (in @ esk3_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_14])).
0.16/0.54	thf(c_0_19, negated_conjecture, (in @ esk2_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_14])).
0.16/0.54	thf(c_0_20, plain, ![X395:$i]:(((in @ X395 @ nat)=>![X394:$i]:(((in @ X394 @ nat)=>![X393:$i]:(((in @ X393 @ nat)=>(((n_pl @ X395 @ X394)=(n_pl @ X395 @ X393))=>((X394)=(X393))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz8a]), c_0_10]), c_0_11])).
0.16/0.54	thf(c_0_21, negated_conjecture, ((n_pl @ esk3_0 @ esk1_0)=(n_pl @ esk2_0 @ esk3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18]), c_0_19])])).
0.16/0.54	thf(c_0_22, negated_conjecture, (in @ esk1_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_14])).
0.16/0.54	thf(c_0_23, plain, ![X473:$i, X474:$i, X475:$i]:((~(in @ X473 @ nat)|(~(in @ X474 @ nat)|(~(in @ X475 @ nat)|(((n_pl @ X473 @ X474)!=(n_pl @ X473 @ X475))|((X474)=(X475))))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])).
0.16/0.54	thf(c_0_24, negated_conjecture, ((n_pl @ esk3_0 @ esk2_0)=(n_pl @ esk2_0 @ esk3_0)), inference(rw,[status(thm)],[c_0_16, c_0_21])).
0.16/0.54	thf(c_0_25, negated_conjecture, ((n_pl @ esk2_0 @ esk3_0)=(n_pl @ esk1_0 @ esk3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_21]), c_0_22]), c_0_18])])).
0.16/0.54	thf(c_0_26, plain, ![X1:$i, X4:$i, X5:$i]:((((X4)=(X5))|~((in @ X1 @ nat))|~((in @ X4 @ nat))|~((in @ X5 @ nat))|((n_pl @ X1 @ X4)!=(n_pl @ X1 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_23])).
0.16/0.54	thf(c_0_27, negated_conjecture, ((n_pl @ esk3_0 @ esk2_0)=(n_pl @ esk1_0 @ esk3_0)), inference(rw,[status(thm)],[c_0_24, c_0_25])).
0.16/0.54	thf(c_0_28, negated_conjecture, ![X1:$i]:((((X1)=(esk2_0))|((n_pl @ esk3_0 @ X1)!=(n_pl @ esk1_0 @ esk3_0))|~((in @ X1 @ nat)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_19]), c_0_18])])).
0.16/0.54	thf(c_0_29, negated_conjecture, ((n_pl @ esk3_0 @ esk1_0)=(n_pl @ esk1_0 @ esk3_0)), inference(rw,[status(thm)],[c_0_21, c_0_25])).
0.16/0.54	thf(c_0_30, negated_conjecture, ((esk1_0)!=(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_14])).
0.16/0.54	thf(c_0_31, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_22])]), c_0_30]), ['proof']).
0.16/0.54	# SZS output end CNFRefutation
0.16/0.54	# Parsed axioms                        : 387
0.16/0.54	# Removed by relevancy pruning/SinE    : 314
0.16/0.54	# Initial clauses                      : 113
0.16/0.54	# Removed in clause preprocessing      : 5
0.16/0.54	# Initial clauses in saturation        : 108
0.16/0.54	# Processed clauses                    : 193
0.16/0.54	# ...of these trivial                  : 4
0.16/0.54	# ...subsumed                          : 14
0.16/0.54	# ...remaining for further processing  : 175
0.16/0.54	# Other redundant clauses eliminated   : 9
0.16/0.54	# Clauses deleted for lack of memory   : 0
0.16/0.54	# Backward-subsumed                    : 0
0.16/0.54	# Backward-rewritten                   : 3
0.16/0.54	# Generated clauses                    : 169
0.16/0.54	# ...of the previous two non-redundant : 148
0.16/0.54	# ...aggressively subsumed             : 0
0.16/0.54	# Contextual simplify-reflections      : 0
0.16/0.54	# Paramodulations                      : 153
0.16/0.54	# Factorizations                       : 0
0.16/0.54	# NegExts                              : 0
0.16/0.54	# Equation resolutions                 : 12
0.16/0.54	# Total rewrite steps                  : 90
0.16/0.54	# Propositional unsat checks           : 0
0.16/0.54	#    Propositional check models        : 0
0.16/0.54	#    Propositional check unsatisfiable : 0
0.16/0.54	#    Propositional clauses             : 0
0.16/0.54	#    Propositional clauses after purity: 0
0.16/0.54	#    Propositional unsat core size     : 0
0.16/0.54	#    Propositional preprocessing time  : 0.000
0.16/0.54	#    Propositional encoding time       : 0.000
0.16/0.54	#    Propositional solver time         : 0.000
0.16/0.54	#    Success case prop preproc time    : 0.000
0.16/0.54	#    Success case prop encoding time   : 0.000
0.16/0.54	#    Success case prop solver time     : 0.000
0.16/0.54	# Current number of processed clauses  : 75
0.16/0.54	#    Positive orientable unit clauses  : 30
0.16/0.54	#    Positive unorientable unit clauses: 0
0.16/0.54	#    Negative unit clauses             : 9
0.16/0.54	#    Non-unit-clauses                  : 36
0.16/0.54	# Current number of unprocessed clauses: 153
0.16/0.54	# ...number of literals in the above   : 571
0.16/0.54	# Current number of archived formulas  : 0
0.16/0.54	# Current number of archived clauses   : 99
0.16/0.54	# Clause-clause subsumption calls (NU) : 1218
0.16/0.54	# Rec. Clause-clause subsumption calls : 445
0.16/0.54	# Non-unit clause-clause subsumptions  : 13
0.16/0.54	# Unit Clause-clause subsumption calls : 19
0.16/0.54	# Rewrite failures with RHS unbound    : 0
0.16/0.54	# BW rewrite match attempts            : 7
0.16/0.54	# BW rewrite match successes           : 2
0.16/0.54	# Condensation attempts                : 193
0.16/0.54	# Condensation successes               : 0
0.16/0.54	# Termbank termtop insertions          : 20890
0.16/0.54	
0.16/0.54	# -------------------------------------------------
0.16/0.54	# User time                : 0.026 s
0.16/0.54	# System time              : 0.009 s
0.16/0.54	# Total time               : 0.035 s
0.16/0.54	# Maximum resident set size: 3364 pages
0.16/0.54	
0.16/0.54	# -------------------------------------------------
0.16/0.54	# User time                : 0.037 s
0.16/0.54	# System time              : 0.012 s
0.16/0.54	# Total time               : 0.048 s
0.16/0.54	# Maximum resident set size: 2344 pages
0.16/0.54	% E---3.1 exiting
0.16/0.54	EOF